In this article, a neural-network-based constrained output-feedback control is considered for microelectromechanical system (MEMS) gyroscopes subject to scarce transmission bandwidth and lumped disturbances resulting from model uncertainties, dynamic coupling, and environmental disturbances. First, a hybrid quantizer capable of achieving an adjustable communication rate and quantization density is proposed to convert continuous control signals into discrete values, allowing for reduced chattering behavior even when control actions vary within large regions and enhanced tracking accuracy can be ensured. Subsequently, by applying two types of nonlinear mapping, all state variables of MEMS gyroscopes are restrained within the predefined time-varying asymmetric functions without imposing stringent feasibility conditions on virtual control laws. Furthermore, an echo-state network-based minimal learning parameter neural observer is developed to simultaneously recover the unmeasurable velocity-state variables, matched as well as unmatched disturbances in constrained MEMS gyroscopes dynamics, enabling an output-feedback control solution with a decreased online learning complexity. It is shown via the Lyapunov stability and nonsmooth analysis that all signals in the closed-loop system remain ultimately uniformly bounded even with discontinuous control actions. Comparison simulations are produced to certify the effectiveness of the presented controller.To achieve sustainable manufacturing of large-scale end-of-life products, disassembly for recycling and remanufacturing has been widely adopted by industries. Disassembly line balancing becomes an important and challenging issue. The disassembly efficiencies of workers are different in the actual disassembly line due to some factors, including disassembly environment, skill level, work enthusiasm, etc. However, efficiency differences are often ignored in previous studies, which ultimately lead to unbalanced workloads among stations. Therefore, this article establishes a disassembly line balancing model that considers workers with different efficiencies and introduces the bucket brigade model into the disassembly line. Its optimization objectives include workload smoothness, cost of workers, disassembly risk, and disassembly demand. To obtain high-quality solutions, a discrete flower pollination algorithm based on problem characteristics is proposed. The performance of the proposed algorithm is verified by comparing it with 11 algorithms. Finally, the proposed model and algorithm are applied to an actual television disassembly case considering workers with different efficiencies, and provide decision makers with multiple disassembly schemes.This article presents a new constraint-handling technique (CHT), called shift-based penalty (ShiP), for solving constrained multiobjective optimization problems. In ShiP, infeasible solutions are first shifted according to the distributions of their neighboring feasible solutions. The degree of shift is adaptively controlled by the proportion of feasible solutions in the current parent and offspring populations. Then, the shifted infeasible solutions are penalized based on their constraint violations. This two-step process can encourage infeasible solutions to approach/enter the feasible region from diverse directions in the early stage of evolution, and guide diverse feasible solutions toward the Pareto optimal solutions in the later stage of evolution. Moreover, ShiP can achieve an adaptive transition from both diversity and feasibility in the early stage of evolution to both diversity and convergence in the later stage of evolution. https://www.selleckchem.com/products/bapta-am.html ShiP is flexible and can be embedded into three well-known multiobjective optimization frameworks. Experiments on benchmark test problems demonstrate that ShiP is highly competitive with other representative CHTs. Further, based on ShiP, we propose an archive-assisted constrained multiobjective evolutionary algorithm (CMOEA), called ShiP?, which outperforms two other state-of-the-art CMOEAs. Finally, ShiP is applied to the vehicle scheduling of the urban bus line successfully.Unsupervised cross-domain fault diagnosis has been actively researched in recent years. It learns transferable features that reduce distribution inconsistency between source and target domains without target supervision. Most of the existing cross-domain fault diagnosis approaches are developed based on the consistency assumption of the source and target fault category sets. This assumption, however, is generally challenged in practice, as different working conditions can have different fault category sets. To solve the fault diagnosis problem under both domain and category inconsistencies, a multisource-refined transfer network is proposed in this article. First, a multisource-domain-refined adversarial adaptation strategy is designed to reduce the refined categorywise distribution inconsistency within each source-target domain pair. It avoids the negative transfer trap caused by conventional global-domainwise-forced alignments. Then, a multiple classifier complementation module is developed by complementing and transferring the source classifiers to the target domain to leverage different diagnostic knowledge existing in various sources. Different classifiers are complemented by the similarity scores produced by the adaptation module, and the complemented smooth predictions are used to guide the refined adaptation. Thus, the refined adversarial adaptation and the classifier complementation can benefit from each other in the training stage, yielding target-faults-discriminative and domain-refined-indistinguishable feature representations. Extensive experiments on two cases demonstrate the superiority of the proposed method when domain and category inconsistencies coexist.Stochastic point location deals with the problem of finding a target point on a real line through a learning mechanism (LM) with the stochastic environment (SE) offering directional information. The SE can be further categorized into an informative or deceptive one, according to whether p is above 0.5 or not, where p is the probability of providing a correct suggestion of a direction to LM. Several attempts have been made for LM to work in both types of environments, but none of them considers a dynamically changing environment where p varies with time. A dynamic dual environment involves fierce changes that frequently cause its environment to switch from an informative one to a deceptive one, or vice versa. This article presents a novel weak estimator-based adaptive step search solution, to enable LM to track the target in a dynamic dual environment, with the help of a weak estimator. The experimental results show that the proposed solution is feasible and efficient.